#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve(int n)
{
	vector<int>v(n);
	for (int i = 0; i < n; i++)
		cin >> v[i];
	int x;
	cin >> x;

	sort(v.begin(), v.end());
	int l = 0, r = n - 1, mid;
	while (l <= r)
	{
		mid = (l + r) / 2;
		if (x == v[mid])
			break;
		else if (x > v[mid])
			l = mid + 1;
		else
			r = mid - 1;
	}

	if (l <= r)
		cout << mid + 1 << endl;
	else
		cout << "No found!" << endl;
}

int main()
{
	int n;
	while (cin >> n)
		solve(n);
	return 0;
}